منابع مشابه
Permutations via linear translators
We show that many infinite classes of permutations over finite fields can be constructed via translators with a large choice of parameters. We first characterize some functions having linear translators, based on which several families of permutations are then derived. Extending the results of [9], we give in several cases the compositional inverse of these permutations. The connection with com...
متن کاملConstructing permutations of finite fields via linear translators
We study the permutations of the finite field Fqn given by x + γ f(x), where γ ∈ Fqn is a linear translator of f : Fqn → Fq. We determine the cycle structure and the inverse of such a permutation. We describe several families of permutation polynomials obtained using functions with linear translators.
متن کاملBent and Semi-bent Functions via Linear Translators
The paper is dealing with two important subclasses of plateaued functions: bent and semi-bent functions. In the first part of the paper, we construct mainly bent and semi-bent functions in the Maiorana-McFarland class using Boolean functions having linear structures (linear translators) systematically. Although most of these results are rather direct applications of some recent results, using l...
متن کاملSimpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
Modular decomposition is fundamental for many important problems in algorithmic graph theory including transitive orientation, the recognition of several classes of graphs, and certain combinatorial optimization problems. Accordingly, there has been a drive towards a practical, linear-time algorithm for the problem. This paper posits such an algorithm; we present a linear-time modular decomposi...
متن کاملOnline Linear Optimization over Permutations
This paper proposes an algorithm for online linear optimization problem over permutations; the objective of the online algorithm is to find a permutation of {1, . . . , n} at each trial so as to minimize the “regret” for T trials. The regret of our algorithm is O(n √ T lnn) in expectation for any input sequence. A naive implementation requires more than exponential time. On the other hand, our ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2017
ISSN: 1071-5797
DOI: 10.1016/j.ffa.2016.11.009